Process Algebraic Analysis of Cryptographic Protocols
نویسندگان
چکیده
Recent approaches to the analysis of crypto-protocols build on concepts which are well-established in the eld of process algebras, such as labelled transition systems (lts) and observational semantics. We outline some recent work in this direction that stems from using cryptographic versions of the pi-calculus { most notably Abadi and Gordon's spi-calculus { as protocol description languages. We show the impact of these approaches on a speciic example, a simpliied version of the Kerberos protocol.
منابع مشابه
Process algebraic modeling of authentication protocols for analysis of parallel multi-session executions
Many security protocols have the aim of authenticating one agent acting as initiator to another agent acting as responder and vice versa. Sometimes, the authentication fails because of executing several parallel sessions of a protocol, and because an agent may play both the initiator and responder role in parallel sessions. We take advantage of the notion of transition systems to specify authen...
متن کاملDesign of cybernetic metamodel of cryptographic algorithms and ranking of its supporting components using ELECTRE III method
Nowadays, achieving desirable and stable security in networks with national and organizational scope and even in sensitive information systems, should be based on a systematic and comprehensive method and should be done step by step. Cryptography is the most important mechanism for securing information. a cryptographic system consists of three main components: cryptographic algorithms, cryptogr...
متن کاملAlgebraic Intruder Deductions ( Extended Version ) ?
Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally analyzing protocols, since basic problems like the equality of terms that represent cryptographic messages are undecidable, even for relatively simple algebraic theories. We present a framework for security protocol analysis that c...
متن کاملAlgebraic Intruder Deductions
Many security protocols fundamentally depend on the algebraic properties of cryptographic operators. It is however difficult to handle these properties when formally analyzing protocols, since basic problems like the equality of terms that represent cryptographic messages are undecidable, even for relatively simple algebraic theories. We present a framework for security protocol analysis that c...
متن کاملImplementing Cryptographic Protocols Based on Algebraic Number Fields | Preliminary Version
We show how to implement cryptographic protocols based on class groups of algebraic number elds of degree > 2. We describe how the involved objects can be represented and how the arithmetic in class groups can be realized eeciently. Furthermore we show how to generate cryptographically suitable algebraic number elds. In the nal version we will give a numerical example and rst timings. Right now...
متن کامل